#define quickread
#ifdef quickread
#include <cstdio> 
template <typename T>
inline void read(T& x)
{
    int c=getchar(), f=1; x=0;
    while(c<'0'||'9'<c) {if(c=='-') f=-1; c=getchar();}
    while('0'<=c&&c<='9') 
        x=(x<<3)+(x<<1)+c-'0', c=getchar();
    x*=f;
}
template <typename T>
inline void quickwrite(T x)
{
    if(x<0) putchar('-'), x*=-1;
    if(x>=10) quickwrite(x/10);
    putchar(x%10+'0');
}
#else 
#include <iostream>
#endif
#include <cmath>
using namespace std;
#define DEBUG
using ll=long long;
const int N=5e3+10;
int n;
ll sum[N], ans[N];

void init()
{
    read(n);
    for(int i=1; i<=n; i++) read(sum[i]), sum[i]+=sum[i-1];
}

void solve()
{
    init();
    for(int i=1; i<=n; i++)
        for(int j=i; j<=n; j++) //枚举区间[i, j] 当前区间和符合，则区间内每个数都有一个区间可选
        {
            ll cursum=sum[j]-sum[i-1]; //printf("[%d, %d] %lld=%lld-%lld\n", i, j, cursum, sum[j], sum[i-1]);
            ll sqr=sqrt(cursum);
            if(sqr*sqr-cursum==0)
                ans[i]++, ans[j+1]--;
        }
    for(int i=1; i<=n; i++)
        ans[i]+=ans[i-1];
    for(int i=1; i<=n; i++)
        quickwrite(ans[i]), puts("");
}

// #undef DEBUG
signed main()
{
    #ifdef DEBUG
        freopen("../in.txt", "r", stdin);
        freopen("../out.txt", "w", stdout);
    #endif
    #ifndef quickread
    ios::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    #endif

    int T=1; //scanf("%d", &T);
    while(T--) 
    {
        solve();
    }
    return 0;
}
